An Extension of Reduction Formula for Littlewood-richardson Coefficients
نویسندگان
چکیده
There is a well-known classical reduction formula by Griffiths and Harris for Littlewood-Richardson coefficients, which reduces one part from each partition. In this article, we consider an extension of the reduction formula reducing two parts from each partition. This extension is a special case of the factorization theorem of Littlewood-Richardson coefficients by King, Tollu, and Toumazet (the KTT theorem). This case of the KTT factorization theorem is of particular interest, because, in this case, the KTT theorem is simply a reduction formula reducing two parts from each partition. A bijective proof using tableaux of this reduction formula is given in this paper while the KTT theorem is proved using hives.
منابع مشابه
A Bijective Proof of the Second Reduction Formula for Littlewood-richardson Coefficients
There are two well known reduction formulae for structural constants of the cohomology ring of Grassmannians, i.e., LittlewoodRichardson coefficients. Two reduction formulae are a conjugate pair in the sense that indexing partitions of one formula are conjugate to those of the other formula. A nice bijective proof of the first reduction formula is given in the authors’ previous paper while a (c...
متن کاملReduction formulae from the factorization Theorem of Littlewood-Richardson polynomials by King, Tollu and Toumazet
The factorization theorem by King, Tollu and Toumazet gives four different reduction formulae of LittlewoodRichardson coefficients. One of them is the classical reduction formula of the first type while others are new. Moreover, the classical reduction formula of the second type is not a special case of KTT theorem. We give combinatorial proofs of reduction formulae in terms of tableaux or hive...
متن کاملExplicit computation of the q,t-Littlewood–Richardson coefficients
In joint work with Michel Lassalle [C. R. Math. Acad. Sci. Paris 337 (9) (2003), 569–574], we recently presented an explicit expansion formula for Macdonald polynomials. This result was obtained from a recursion for Macdonald polynomials which in turn was derived by inverting the Pieri formula. We use these formulae here to explicitly compute the q, t-Littlewood– Richardson coefficients, thus s...
متن کاملLittlewood–Richardson polynomials
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are polynomials in the parameters which we call the Littlewood–Richardson polynomials. We give a combinatorial rule for their calculation by modifying an earlier resu...
متن کاملLittlewood-Richardson Coefficients and Integrable Tilings
We provide direct proofs of product and coproduct formulae for Schur functions where the coefficients (Littlewood–Richardson coefficients) are defined as counting puzzles. The product formula includes a second alphabet for the Schur functions, allowing in particular to recover formulae of [Molev–Sagan ’99] and [Knutson–Tao ’03] for factorial Schur functions. The method is based on the quantum i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010